Parallel algorithms for red–black trees

Parallel Dynamic Algorithms for MinimumSpanning Trees

Practical Parallel Algorithms for Minimum Spanning Trees

We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p is the number of processors. For this case, we show that simple algorithms with dataindependent communication patterns are efficient, both in theory and in practice. The algorithms are evaluated theoretically using Va...

Parallel Algorithms for Computing Prüfer-Like Codes for Labeled Trees

In 1918 Prüfer showed a one-to-one correspondence between labeled trees on n nodes and sequences of (n 2) node labels, obtained by iteratively deleting the leaf with the smallest label in the current tree and appending the label of the adjacent node to the code. In 1953 Neville proposed two additional methods for encoding a labeled tree of order n into a sequence of (n 2) labels. Recently, yet ...

Parallel Join Algorithms based on Parallel B+-trees

Within the last several years, a number of parallel algorithms for the join operation have been proposed. However, almost all of the algorithms did not take advantages of the underlying parallel storage structures or data declustering methods of the operand relations. This paper introduces the concept of parallel storage structure or declustering aware parallel join algorithm. A parallel B+-tre...

Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

The following tree pattern matching problem is considered: Given two unordered labeled trees P and T , find all occurrences of P in T . Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs i...